Interpolative Boolean Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supplier Selection Using Interpolative Boolean Algebra and Logic Aggregation

The interest of the decision makers in the selection process of suppliers is constantly growing as a reliable supplier reduces costs and improves the quality of products/services. This process is essentially reducible to the problem of multi-attribute decision-making. Namely, the large number of quantitative and qualitative attributes is considered. This paper presents a model of supplier selec...

متن کامل

Logical Aggregation Based on Interpolative Realization of Boolean Algebra

In this paper, aggregation is treated as a logical and/or pseudo-logical operation what is important from many points of view such as adequacy and interpretations.

متن کامل

Introducing Interpolative Boolean algebra into Intuitionistic fuzzy sets

In this paper, we introduce Interpolative Boolean algebra (IBA) as a suitable algebra for intuitionistic fuzzy sets (IFSs). IBA is [0,1]-valued realization of Boolean algebra, consistent with Boolean axioms and theorems. IFS theory takes into account both membership and non-membership function, so it can be viewed as a generalization of the traditional fuzzy set theory. We propose a realization...

متن کامل

Identification problems for Boolean networks and Boolean control networks

In this paper we address various forms of identification problems for Boolean networks (BNs) and for Boolean control networks (BCNs). For the former, we assume to have a set of infinite or finite support output trajectories and we want to identify a BN compatible with those trajectories. Conditions for the identified BN to coincide (up to a relabeling) with the original BN are provided. For BCN...

متن کامل

Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks

We prove that the fully asynchronous dynamics of a Boolean network f : {0, 1} → {0, 1} without negative loop can be simulated, in a very specific way, by a monotone Boolean network with 2n components. We then use this result to prove that, for every even n, there exists a monotone Boolean network f : {0, 1} → {0, 1}, an initial configuration x and a fixed point y of f such that: (i) y can be re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complexity

سال: 2017

ISSN: 1076-2787,1099-0526

DOI: 10.1155/2017/2647164